Functional Bisimulations
نویسنده
چکیده
Functional Bisimulations constitute a unifying framework for the equivalence of operational semantics and the correctness of implementations on an abstract machine. In the deterministic setting, functional bisimula-tions are in one-to-one correspondence to partial Lagois Connections with lower sets as domains of deenition. Unlike as for relational bisimulations in concurrency, functional bisimulations have no trivial form of composition. We compose functional bisimulations using an associative structure of x points.
منابع مشابه
The Subobject Classier of the Category of Functional Bisimulations
We show the existence of subobject classi er in the category of nondeterministic dynamical systems and functional bisimulations.
متن کاملConcise Graphs and Functional Bisimulations
We investigate the conditions under which least bisimulations exist with respect to set inclusion. In particular, we describe a natural way to remove redundant pairs from a given bisimulation. We then introduce the conciseness property on process graphs, which characterizes the existence of least bisimulations under the aforementioned method. Subsequently, we consider the category of process gr...
متن کاملA Completeness Result for Finite λ-bisimulations
We show that finite λ-bisimulations (closely related to bisimulations up to context) are sound and complete for finitely generated λ-bialgebras for distributive laws λ of a monad T on Set over an endofunctor F on Set, such that F preserves weak pullbacks and finitely generated T -algebras are closed under taking kernel pairs. This result is used to infer the decidability of weighted language eq...
متن کاملA Calculus for True Concurrency
We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...
متن کاملSound Bisimulations for Higher-Order Distributed Process Calculus
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in the higher-order π-calculus with passivation (and restriction). Previous research for this calculus is limited to context bisimulations and nor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007